Pattern Matching in Strings
نویسنده
چکیده
منابع مشابه
Abelian pattern matching in strings
Abelian pattern matching is a new class of pattern matching problems. In abelian patterns, the order of the characters in the substrings does not matter, e.g. the strings abbc and babc represent the same abelian pattern a+2b+c. Therefore, unlike classical pattern matching, we do not look for an exact (ordered) occurrence of a substring, rather the aim here is to find any permutation of a given ...
متن کاملFragmentary Pattern Matching: Complexity, Algorithms and Applications for Analyzing Classic Literary Works
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues on computational complexity related to the matching of fragmentary patterns. We show that the fragmentary pattern matching problem is NP-complete, and the problem to find a fragmentary pattern common to two strings tha...
متن کاملFace Recognition using Approximate String Matching
String matching algorithm is a very useful algorithm in pattern matching that can be used to match any patterns that can be represented in strings or sequence. This paper will discussed how string matching can be used as a method for face recognition. We will focus on the implementation using approximate string matching. In order for face images to be implemented in pattern matching, they have ...
متن کاملParameterized matching on non-linear structures
The classical pattern matching paradigm is that of seeking occurrences of one string in another, where both strings are drawn from an alphabet set Σ. In the parameterized pattern matching model, a consistent renaming of symbols from Σ is allowed in a match. The parameterized matching paradigm has proven useful in problems in software engineering, computer vision, and other applications. In clas...
متن کاملAlmost Optimal Fully LZW-Compressed Pattern Matching
Given two strings: pattern P and text T of lengths jPj =M and jT j = N . A string matching problem is to nd all occurrences of pattern P in text T . A fully compressed string matching problem is the string matching problem with input strings P and T given in compressed forms p and t respectively, where jpj = m and jtj = n. We present rst, almost optimal, string matching algorithms for LZW-compr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998